Computationally efficient sequential learning algorithms for direct link resource-allocating networks
نویسندگان
چکیده
منابع مشابه
Sample and Computationally Efficient Learning Algorithms under S-Concave Distributions
We provide new results for noise-tolerant and sample-efficient learning algorithms under s-concavedistributions. The new class of s-concave distributions is a broad and natural generalization of log-concavity, and includes many important additional distributions, e.g., the Pareto distribution and t-distribution. This class has been studied in the context of efficient sampling, i...
متن کاملComputationally Efficient Evolutionary Algorithms: Enhanced by On-line Machine Learning
An efficient evolutionary optimization algorithm of which the convergence is improved is proposed. A “machine” which learns the parameter-cost relations on-line is implemented inside the evolutionary algorithm, and the machine reuses the parameter-cost information as training sets to update the hypothesis functions. As the populations converge and regression accuracy improves, some portion of t...
متن کاملEfficient learning algorithms for neural networks (ELEANNE)
This paper presents the development of several Efficient LEarning Algorithms for Neural NEtworks (ELEANNE). The ELEANNE 1 and ELEANNE 2 are two recursive leastsquares learning algorithms, proposed for training single-layered neural networks with analog output. This paper also proposes a new optimization strategy for training single-layered neural networks, which provides the basis for the devel...
متن کاملLocal Learning Algorithms for Sequential Tasks in Neural Networks
In this paper we explore the concept of sequential learning and the efficacy of global and local neural network learning algorithms on a sequential learning task. Pseudorehearsal (a method developed by Robins [19] to solve the catastrophic forgetting problem which arises from the excessive plasticity of neural networks) is significantly more effective than other local learning algorithms for th...
متن کاملComputationally Efficient Two Stage Sequential Framework for Stereo Matching
Almost all the existing stereo algorithms fall under a common assumption that corresponding color or intensity values will be similar like one another. On the other hand, it is also not that true in practice where the image color or intensity values are regularly affected by different radiometric factors like illumination direction, change in image device, illuminant color and so on. For this i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2005
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2005.02.017